package cg.studio.practise.interview;

public interface Google
{
  /**
   * system design:
   * the advertise system, the structure
   */
  
  /**
   * system design:
   * the news system of last decade
   */
  
  /**
   * game: have walls, borders, left/right/up/down for directions. we go one direction, 
   * go to until meet the wall or border
   * 
   * further question, what if there are multiple destinations?
   * 
   * how to optimize? the destinations probably have different sequences?
   * for example: you can go from D1-->D2, but can go from D2-->D1
   * 
   */
  
  /**
   * input suggestion problem.
   * what if the tree is very huge?
   */
  
  /**
   * provide a method boolean isValidWord( String ).
   * implement method String getLongestValidWord( String )
   * which get the word with largest length via only remove characters from the String
   * 
   * for example: suppose goog, gool, gogle are valid words
   * then  getLongestValidWord( "google" ) should return "gogle"
   */
  
  /**
   * input edges for graph, find the number of triangle in the graph
   */
}
